A Domain Theoretic Characterisation of the Universal Relation†
نویسندگان
چکیده
We present a domain theoretic characterisation of the weak instance approach to the universal relation (UR) model. This characterisation gives us a better understanding of the semantics of the UR model. In particular, we show that the representative instance is the least upper bound of a transformation function on the database, which is analogous to the well-known chase procedure. In addition, we show that the representative instance is, in fact, the greatest lower bound of the set of corresponding weak instances for the given database and the set of integrity constraints.
منابع مشابه
A proof-theoretic universal property of determiners
Determiners are the natural language (NL) analogue of quantifiers in logic. In model-theoretic semantics (MTS), their denotations are taken as binary relation over subsets of the domain of the model (see [3] for an extensive discussion). When combined with a noun-meaning, a subset of the domain, they give rise to determiner phrase (dp), which, according to the generalised quantifiers theory [1]...
متن کاملAn investigation on regular relations of universal hyperalgebras
In this paper, by considering the notion of $Sigma$-hyperalgebras for an arbitrary signature $Sigma$, we study the notions of regular and strongly regular relations on a $Sigma$-hyperalgebra, $mathfrak{A}$. We show that each regular relation which contains a strongly regular relation is a strongly regular relation. Then we concentrate on the connection between the fundamental relation of $mathf...
متن کاملCategory Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What?
Universal algebra is often known within computer science in the guise of algebraic specification or equational logic. In 1963, it was given a category theoretic characterisation in terms of what are now called Lawvere theories. Unlike operations and equations, a Lawvere theory is uniquely determined by its category of models. Except for a caveat about nullary operations, the notion of Lawvere t...
متن کاملA module theoretic approach to zero-divisor graph with respect to (first) dual
Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...
متن کاملUniversal Recursively Enumerable Sets of Strings
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the spectrum function sW (n) mapping n to the number of all strings of length n in the set W . An r.e. prefix-free set W is the superset of the domain of a universal machine iff there are two constants c, d such that sW ...
متن کامل